The main purpose of this paper is to obtain su cient conditions for existence of points of coincidence and common  xed points for three self mappings in b-metric spaces. Next, we obtain cone b-metric version of these results by using a scalarization function. Our results extend and generalize several well known comparable results in the existing literature.

We study the extended scalar-tensor Gauss-Bonnet. First, we review a model in which there is a coupling between the Gauss-Bonnet scalar and the scalar field. Then we extend the model to a hybrid model with two scalar fields. We study the conditions under which the solutions are unstable and spontaneous scalarization occurs. We show that the coupling coefficients in the hybrid state and in the presence of a scalar field are asymptotically the same but the sufficient condition of instability is different between these two models.

In this paper, approximate efficient (-efficient) solutions of multiobjective optimization problems are investigated. One of the most important methods for solving multiobjective optimization problems is to use scalarization techniques. In these methods, a single objective optimization problem corresponding to the multiobjective problem is solved, and the relationship between optimal solutions of the single objective problem and (weakly, properly) efficient solutions of the multiobjective problem is investigated. In this paper, a combination of the modified constrained and elastic constrained scalarization methods is considered, which will provide necessary and sufficient conditions for generating approximate (weakly, properly) efficient solutions. We compare the results with the necessary and sufficient conditions obtained from the modified constrained and the elastic constrained methods. The presented results can be applied for every multiobjective optimization problem without any convexity assumption for the objective functions. Unlike many of the previous methods, the obtained results are also consistent with multiobjective problems with unbounded criterion space.

A characteristic of Data Envelopment Analysis (DEA) is to allow individual decision making units (DMUs) to select the factor weights which are the most advantageous for them in calculating their efficiency scores. This flexibility in selecting the weights, on the other hand, deters the comparison among DMUs on a common base. For dealing with this difficulty and assessing all the DMUs on the same scale, this paper proposes using a multiple objective linear programming (MOLP) approach based on scalarizing function for generating common set of weights under the DEA framework. This is an advantageous of the proposed approach against general approaches in the literature which are based on multiple objective nonlinear programming.

This paper analyzes the performance of a robotic system with two machines in which machines are configured in a circular layout and produce non-identical parts repetitively. The non-destructive testing (NDT) is performed by a stationary robotic arm located in the center of the circle, or a cluster tool. The robotic arm integrates multiple tasks, mainly the NDT of the part and its transition between a pair of machines. The robotic arm cannot complete the transition if it identifies a fault in the part. The main feature of the NDT technology is that its required time is changed by altering the testing cost. This generates a trade-off between cost and cycle time. Initially, the problem of robotic arm scheduling and part sequencing is jointly solved to supports the decision making for reliability improvement of small-scale robotic systems with NDT technologies. We show how the case of non-identical parts can be converted into a travelling salesman problem (TSP). Then, we provide a generalization of the framework based on three characteristics: pickup criterion, layout and travel time metric. The results are extended for the interval and no-wait pickup criteria, and then some notes are provided for travel time saving of different layout and travel time metric. It is shown whether circular systems are equivalent to linear systems, or they dominate linear cases in general terms.